Decoding across the quantum low-density parity-check code landscape

Low-Density Parity-Check Code with Fast Decoding Speed

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes [7]. An important design issue for LDPC codes is designing codes with fast decoding speed while maintaining capacityapproaching performance. In another words, it is desirable that the c...

A Proposed Quantum Low Density Parity Check Code

Distributed decoding of rectangular parity-check code

Introduction: The goal of this Letter is to investigate the possibility of achieving spatial diversity without the use of physically connected antenna arrays by examining the simple case of a two-node network. We consider a pair of nodes that are connected via a communication channel that has relatively benign characteristics. Typically, these two nodes are in close proximity. For simplicity, w...

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...

Early Decision Decoding Methods for Low-Density Parity-Check Codes

Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the dec...